Reachability computation for polynomial dynamical systems
نویسندگان
چکیده
منابع مشابه
Approximate Reachability Computation for Polynomial Systems
In this paper we propose an algorithm for approximating the reachable sets of systems defined by polynomial differential equations. Such systems can be used to model a variety of physical phenomena. We first derive an integration scheme that approximates the state reachable in one time step by applying some polynomial map to the current state. In order to use this scheme to compute all the stat...
متن کاملReachability Analysis for Polynomial Dynamical Systems Using the Bernstein Expansion
This paper is concerned with the reachability computation problem for polynomial dynamical systems. Such computations constitute a crucial component in algorithmic verification tools for hybrid systems and embedded software with polynomial dynamics, which have found applications in many engineering domains. We describe two methods for overapproximating reachable sets of such systems; these meth...
متن کاملNLTOOLBOX: A Library for Reachability Computation of Nonlinear Dynamical Systems
We describe NLTOOLBOX, a library of data structures and algorithms for reachability computation of nonlinear dynamical systems. It provides the users with an easy way to ”program” their own analysis procedures or to solve other problems beyond verification. We illustrate the use of the library for the analysis of a biological model.
متن کاملReachability in One-Dimensional Controlled Polynomial Dynamical Systems
In this paper we investigate a case of the reachability problem in controlled o-minimal dynamical systems. This problem can be formulated as follows. Given a controlled o-minimal dynamical system initial and target sets, find a finite choice of time points and control parameters applied at these points such that the target set is reachable from the initial set. We prove that the existence of a ...
متن کاملImage Computation for Polynomial Dynamical Systems Using the Bernstein Expansion
This paper is concerned with the problem of computing the image of a set by a polynomial function. Such image computations constitute a crucial component in typical tools for set-based analysis of hybrid systems and embedded software with polynomial dynamics, which found applications in various engineering domains. One typical example is the computation of all states reachable from a given set ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formal Methods in System Design
سال: 2017
ISSN: 0925-9856,1572-8102
DOI: 10.1007/s10703-016-0266-3